Dynamic Graph Regularization and Label Relaxation-Based Sparse Matrix Regression for Two-Dimensional Feature Selection
نویسندگان
چکیده
منابع مشابه
Feature Selection, Sparsity, Regression Regularization
from Wikipedia A feature selection algorithm can be seen as the combination of a search technique for proposing new feature subsets, along with an evaluation measure which scores the different feature subsets. The simplest algorithm is to test each possible subset of features finding the one which minimizes the error rate. This is an exhaustive search of the space, and is computationally intrac...
متن کاملMulti-View Budgeted Learning under Label and Feature Constraints Using Label-Guided Graph-Based Regularization
Budgeted learning under constraints on both the amount of labeled information and the availability of features at test time pertains to a large number of real world problems. Ideas from multi-view learning, semisupervised learning, and even active learning have applicability, but a common framework whose assumptions fit these problem spaces is non-trivial to construct. We leverage ideas from th...
متن کاملFeature Selection and Cancer Classification via Sparse Logistic Regression with the Hybrid L1/2 +2 Regularization
Cancer classification and feature (gene) selection plays an important role in knowledge discovery in genomic data. Although logistic regression is one of the most popular classification methods, it does not induce feature selection. In this paper, we presented a new hybrid L1/2 +2 regularization (HLR) function, a linear combination of L1/2 and L2 penalties, to select the relevant gene in the lo...
متن کاملFeature Selection by Joint Graph Sparse Coding
This paper takes manifold learning and regression simultaneously into account to perform unsupervised spectral feature selection. We first extract the bases of the data, and then represent the data sparsely using the extracted bases by proposing a novel joint graph sparse coding model, JGSC for short. We design a new algorithm TOSC to compute the resulting objective function of JGSC, and then t...
متن کاملNonparametric Redundant Features Removal for Unsupervised Feature Selection: An Empirical Study based on Sparse Feature Graph
It is known that the redundant features existing in high dimensional datasets will affect the performance of learning and mining algorithms. How to detect and remove them is a challenge in machine learning and data mining research. In this work, we propose a graph based approach to search and remove those redundant features automatically for high dimensional data. A sparse graph is generated at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2983829